Complexity of Control by Partitioning Veto and Maximin Elections

نویسندگان

  • Cynthia Maushagen
  • Jörg Rothe
چکیده

Control by partition refers to situations where an election chair seeks to influence the outcome of an election by partitioning either the candidates or the voters into two groups, thus creating two first-round subelections that determine who will take part in a final round. The model of partition-ofvoters control attacks is remotely related to “gerrymandering” (maliciously resizing election districts). While the complexity of control by partition (and other control actions) has been studied thoroughly for many voting systems, such results about the important systems veto and maximin voting are sparse. We settle the complexity of control by partition for veto in a broad variety of models and for maximin with respect to destructive control by partition of candidates.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity of Control by Partition of Voters and of Voter Groups in Veto and Other Scoring Protocols

In order to model maliciously resizing election districts (a.k.a. gerrymandering), Bartholdi et al. [2] introduced control by partition of voters, which means that an election chair can influence the outcome of an election to her advantage by partitioning the voters such that two first-round subelections are created whose winners will take part in a final run-off. Control by partition of voter ...

متن کامل

Controlling elections with bounded single-peaked width

The problems of controlling an election have been shown NP-complete in general but polynomial-time solvable in single-peaked elections for many voting correspondences. To explore the complexity border, we consider these control problems by adding/deleting votes in elections with bounded single-peaked width k. Single-peaked elections have singlepeaked width k = 1. We prove that the constructive ...

متن کامل

Controlling Elections by Replacing Candidates or Votes

We consider elections where the chair replaces either candidates or votes, with the goal of making a specific candidate win (constructive control) or lose (destructive control). We call this “replacement control” and study its computational complexity for several scoring rules (plurality, veto, Borda, k-approval), as well as for approval voting.

متن کامل

How Hard is Control in Multi-Peaked Elections: (Extended Abstract)

We study the complexity of voting control problems in multi-peaked elections. In particular, we focus on the constructive/destructive control by adding/deleting votes under Condorcet, Maximin and Copeland voting systems. We show that the NP-hardness of these problems (except for the destructive control by adding/deleting votes under Condorcet, which is polynomial-time solvable in the general ca...

متن کامل

Controlling Elections by Replacing Candidates: Theoretical and Experimental Results

We consider elections where the chair may attempt to influence the result by replacing candidates with the intention to make a specific candidate lose (destructive control). We call this form of control “replacement control” and we study its computational complexity. We focus in particular on Plurality and Veto, for which we prove that destructive control via replacing candidates is computation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016